Finite-window RLS algorithms
نویسندگان
چکیده
Two recursive least-squares (RLS) adaptive filtering algorithms are most often used in practice, the exponential and sliding (rectangular) window RLS algorithms. This popularity is mainly due to existence of low-complexity versions these However, two windows not always best choice for identification fast time-varying systems, when performance important. In this paper, we show how with arbitrary finite-length can be implemented at a complexity comparable that Then, as an example, improvement using proposed finite-window algorithm Hanning systems.
منابع مشابه
Group Sparse RLS Algorithms
Group sparsity is one of the important signal priors for regularization of inverse problems. Sparsity with group structure is encountered in numerous applications. However, despite the abundance of sparsity based adaptive algorithms, attempts at group sparse adaptive methods are very scarce. In this paper we introduce novel Recursive Least Squares (RLS) adaptive algorithms regularized via penal...
متن کاملFixed window constant modulus algorithms
W e propose two batch versions of the constant modulus algorithm in which a fixed block of samples is iteratively reused. The convergence rate of the algorithms is shown to be very fast. The delay to which the algorithms converge can be determined i f the peak position of the initialized global channel/equalizer response is known. These fixed window CM algorithms are data eficient, computationa...
متن کاملSensitivity Analysis of Transversal RLS Algorithms With Correlated Inputs
In this contribution it is shown that the sensitivity analysis predicts that the mean square excess error is the same for both correlated and white inputs. Correlation increases the variance about the mean square excess error. We also present a stable finite precision RLS algorithm. Many adaptive filtering problems can be cast as a systems identification problem. Consider the desired signal d(n...
متن کاملFast RLS Algorithms Running On Roughly Quantized Signals
A framework for obtaining fast RLS algorithms which use a roughly quantized auxiliary input signal for eeciently updating the required adaptation gain vector is presented. The new adaptation procedure is very similar to the conventional fast RLS adaptation. Analytically, it is shown that the lter weights are found by solving almost the same normal equations corresponding to the RLS case. Obtain...
متن کاملTracking Ill-Conditioning for the RLS-Lattice Algorithms
The numerical performance of lattice-based adaptive signal processing algorithms is shown to involve the conditioning of a 2 × 2 matrix whose off-diagonal elements contain reflection coefficients. Degraded algorithmic performance for the a posteriori Recursive Least Squares Lattice (RLSL) is shown to be attributed to the ill-conditioning of this matrix. Theoretical results are given which may b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Signal Processing
سال: 2022
ISSN: ['0165-1684', '1872-7557']
DOI: https://doi.org/10.1016/j.sigpro.2022.108599